0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n017.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 08:27:49 EDT 2025
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.74/0.92	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.Q1pWfyYTXa/E---3.1_2432.p
8.39/2.15	# Version: 3.0.0-ho
8.39/2.15	# Preprocessing class: HMLMSMSLSSLNSFA.
8.39/2.15	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
8.39/2.15	# Starting new_bool_1 with 1200s (5) cores
8.39/2.15	# Starting post_as_ho6 with 240s (1) cores
8.39/2.15	# Starting post_as_ho8 with 240s (1) cores
8.39/2.15	# Starting pre_casc_4 with 240s (1) cores
8.39/2.15	# new_bool_1 with pid 2531 completed with status 0
8.39/2.15	# Result found by new_bool_1
8.39/2.15	# Preprocessing class: HMLMSMSLSSLNSFA.
8.39/2.15	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
8.39/2.15	# Starting new_bool_1 with 1200s (5) cores
8.39/2.15	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
8.39/2.15	# Search class: HGHSM-SMLM32-DSFFFFNN
8.39/2.15	# partial match(1): HGHSM-SMLM32-DSFFFFBN
8.39/2.15	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
8.39/2.15	# Starting post_as_ho7 with 721s (1) cores
8.39/2.15	# Starting post_as_ho8 with 121s (1) cores
8.39/2.15	# Starting full_lambda_3 with 121s (1) cores
8.39/2.15	# Starting post_as_ho6 with 121s (1) cores
8.39/2.15	# Starting new_bool_1 with 116s (1) cores
8.39/2.15	# post_as_ho8 with pid 2536 completed with status 0
8.39/2.15	# Result found by post_as_ho8
8.39/2.15	# Preprocessing class: HMLMSMSLSSLNSFA.
8.39/2.15	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
8.39/2.15	# Starting new_bool_1 with 1200s (5) cores
8.39/2.15	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
8.39/2.15	# Search class: HGHSM-SMLM32-DSFFFFNN
8.39/2.15	# partial match(1): HGHSM-SMLM32-DSFFFFBN
8.39/2.15	# Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total)
8.39/2.15	# Starting post_as_ho7 with 721s (1) cores
8.39/2.15	# Starting post_as_ho8 with 121s (1) cores
8.39/2.15	# Preprocessing time       : 0.049 s
8.39/2.15	# Presaturation interreduction done
8.39/2.15	
8.39/2.15	# Proof found!
8.39/2.15	# SZS status Theorem
8.39/2.15	# SZS output start CNFRefutation
8.39/2.15	thf(decl_sort1, type, del: $tType).
8.39/2.15	thf(decl_23, type, bool: del).
8.39/2.15	thf(decl_25, type, arr: del > del > del).
8.39/2.15	thf(decl_26, type, mem: $i > del > $o).
8.39/2.15	thf(decl_27, type, ap: $i > $i > $i).
8.39/2.15	thf(decl_200, type, c_2Epair_2ECURRY: del > del > del > $i).
8.39/2.15	thf(decl_208, type, c_2Epair_2EUNCURRY: del > del > del > $i).
8.39/2.15	thf(decl_500, type, c_2Eset__relation_2Erel__to__reln: del > del > $i).
8.39/2.15	thf(decl_501, type, c_2Eset__relation_2Ereln__to__rel: del > del > $i).
8.39/2.15	thf(decl_516, type, esk1_0: del).
8.39/2.15	thf(decl_517, type, esk2_0: del).
8.39/2.15	thf(decl_518, type, esk3_0: $i).
8.39/2.15	thf(conj_thm_2Eset__relation_2Erel__to__reln__inv, conjecture, ![X13:del, X29:del, X195:$i]:(((mem @ X195 @ (arr @ X13 @ (arr @ X29 @ bool)))=>((ap @ (c_2Eset__relation_2Ereln__to__rel @ X13 @ X29) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ X13 @ X29) @ X195))=(X195)))), file('/export/starexec/sandbox2/tmp/tmp.Q1pWfyYTXa/E---3.1_2432.p', conj_thm_2Eset__relation_2Erel__to__reln__inv)).
8.39/2.15	thf(conj_thm_2Epair_2ECURRY__UNCURRY__THM, axiom, ![X13:del, X29:del, X62:del, X34:$i]:((((ap @ (c_2Epair_2ECURRY @ X13 @ X29 @ X62) @ (ap @ (c_2Epair_2EUNCURRY @ X13 @ X29 @ X62) @ X34))=(X34))<=(mem @ X34 @ (arr @ X13 @ (arr @ X29 @ X62))))), file('/export/starexec/sandbox2/tmp/tmp.Q1pWfyYTXa/E---3.1_2432.p', conj_thm_2Epair_2ECURRY__UNCURRY__THM)).
8.39/2.15	thf(conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY, axiom, ![X13:del, X29:del]:(((c_2Eset__relation_2Ereln__to__rel @ X13 @ X29)=(c_2Epair_2ECURRY @ X13 @ X29 @ bool))), file('/export/starexec/sandbox2/tmp/tmp.Q1pWfyYTXa/E---3.1_2432.p', conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY)).
8.39/2.15	thf(conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY, axiom, ![X13:del, X29:del]:(((c_2Eset__relation_2Erel__to__reln @ X13 @ X29)=(c_2Epair_2EUNCURRY @ X13 @ X29 @ bool))), file('/export/starexec/sandbox2/tmp/tmp.Q1pWfyYTXa/E---3.1_2432.p', conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY)).
8.39/2.15	thf(c_0_4, negated_conjecture, ~(![X13:del, X29:del, X195:$i]:(((mem @ X195 @ (arr @ X13 @ (arr @ X29 @ bool)))=>((ap @ (c_2Eset__relation_2Ereln__to__rel @ X13 @ X29) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ X13 @ X29) @ X195))=(X195))))), inference(assume_negation,[status(cth)],[conj_thm_2Eset__relation_2Erel__to__reln__inv])).
8.39/2.15	thf(c_0_5, plain, ![X13:del, X29:del, X62:del, X34:$i]:(((mem @ X34 @ (arr @ X13 @ (arr @ X29 @ X62)))=>((ap @ (c_2Epair_2ECURRY @ X13 @ X29 @ X62) @ (ap @ (c_2Epair_2EUNCURRY @ X13 @ X29 @ X62) @ X34))=(X34)))), inference(fof_simplification,[status(thm)],[conj_thm_2Epair_2ECURRY__UNCURRY__THM])).
8.39/2.15	thf(c_0_6, negated_conjecture, ((mem @ esk3_0 @ (arr @ esk1_0 @ (arr @ esk2_0 @ bool)))&((ap @ (c_2Eset__relation_2Ereln__to__rel @ esk1_0 @ esk2_0) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ esk1_0 @ esk2_0) @ esk3_0))!=(esk3_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
8.39/2.15	thf(c_0_7, plain, ![X3623:del, X3624:del]:(((c_2Eset__relation_2Ereln__to__rel @ X3623 @ X3624)=(c_2Epair_2ECURRY @ X3623 @ X3624 @ bool))), inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY])).
8.39/2.15	thf(c_0_8, plain, ![X3605:del, X3606:del]:(((c_2Eset__relation_2Erel__to__reln @ X3605 @ X3606)=(c_2Epair_2EUNCURRY @ X3605 @ X3606 @ bool))), inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY])).
8.39/2.15	thf(c_0_9, plain, ![X4453:del, X4454:del, X4455:del, X4456:$i]:((~(mem @ X4456 @ (arr @ X4453 @ (arr @ X4454 @ X4455)))|((ap @ (c_2Epair_2ECURRY @ X4453 @ X4454 @ X4455) @ (ap @ (c_2Epair_2EUNCURRY @ X4453 @ X4454 @ X4455) @ X4456))=(X4456)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
8.39/2.15	thf(c_0_10, negated_conjecture, ((ap @ (c_2Eset__relation_2Ereln__to__rel @ esk1_0 @ esk2_0) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ esk1_0 @ esk2_0) @ esk3_0))!=(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
8.39/2.15	thf(c_0_11, plain, ![X1:del, X2:del]:(((c_2Eset__relation_2Ereln__to__rel @ X1 @ X2)=(c_2Epair_2ECURRY @ X1 @ X2 @ bool))), inference(split_conjunct,[status(thm)],[c_0_7])).
8.39/2.15	thf(c_0_12, plain, ![X1:del, X2:del]:(((c_2Eset__relation_2Erel__to__reln @ X1 @ X2)=(c_2Epair_2EUNCURRY @ X1 @ X2 @ bool))), inference(split_conjunct,[status(thm)],[c_0_8])).
8.39/2.15	thf(c_0_13, plain, ![X4:$i, X1:del, X2:del, X13:del]:((((ap @ (c_2Epair_2ECURRY @ X1 @ X2 @ X13) @ (ap @ (c_2Epair_2EUNCURRY @ X1 @ X2 @ X13) @ X4))=(X4))|~((mem @ X4 @ (arr @ X1 @ (arr @ X2 @ X13)))))), inference(split_conjunct,[status(thm)],[c_0_9])).
8.39/2.15	thf(c_0_14, negated_conjecture, (mem @ esk3_0 @ (arr @ esk1_0 @ (arr @ esk2_0 @ bool))), inference(split_conjunct,[status(thm)],[c_0_6])).
8.39/2.15	thf(c_0_15, negated_conjecture, ((ap @ (c_2Epair_2ECURRY @ esk1_0 @ esk2_0 @ bool) @ (ap @ (c_2Epair_2EUNCURRY @ esk1_0 @ esk2_0 @ bool) @ esk3_0))!=(esk3_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
8.39/2.15	thf(c_0_16, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), ['proof']).
8.39/2.15	# SZS output end CNFRefutation
8.39/2.15	# Parsed axioms                        : 3387
8.39/2.15	# Removed by relevancy pruning/SinE    : 2813
8.39/2.15	# Initial clauses                      : 2131
8.39/2.15	# Removed in clause preprocessing      : 921
8.39/2.15	# Initial clauses in saturation        : 1210
8.39/2.15	# Processed clauses                    : 2072
8.39/2.15	# ...of these trivial                  : 15
8.39/2.15	# ...subsumed                          : 197
8.39/2.15	# ...remaining for further processing  : 1860
8.39/2.15	# Other redundant clauses eliminated   : 310
8.39/2.15	# Clauses deleted for lack of memory   : 0
8.39/2.15	# Backward-subsumed                    : 3
8.39/2.15	# Backward-rewritten                   : 9
8.39/2.15	# Generated clauses                    : 16728
8.39/2.15	# ...of the previous two non-redundant : 16247
8.39/2.15	# ...aggressively subsumed             : 0
8.39/2.15	# Contextual simplify-reflections      : 3
8.39/2.15	# Paramodulations                      : 16082
8.39/2.15	# Factorizations                       : 4
8.39/2.15	# NegExts                              : 28
8.39/2.15	# Equation resolutions                 : 316
8.39/2.15	# Disequality decompositions           : 0
8.39/2.15	# Total rewrite steps                  : 813
8.39/2.15	# ...of those cached                   : 724
8.39/2.15	# Propositional unsat checks           : 0
8.39/2.15	#    Propositional check models        : 0
8.39/2.15	#    Propositional check unsatisfiable : 0
8.39/2.15	#    Propositional clauses             : 0
8.39/2.15	#    Propositional clauses after purity: 0
8.39/2.15	#    Propositional unsat core size     : 0
8.39/2.15	#    Propositional preprocessing time  : 0.000
8.39/2.15	#    Propositional encoding time       : 0.000
8.39/2.15	#    Propositional solver time         : 0.000
8.39/2.15	#    Success case prop preproc time    : 0.000
8.39/2.15	#    Success case prop encoding time   : 0.000
8.39/2.15	#    Success case prop solver time     : 0.000
8.39/2.15	# Current number of processed clauses  : 711
8.39/2.15	#    Positive orientable unit clauses  : 148
8.39/2.15	#    Positive unorientable unit clauses: 9
8.39/2.15	#    Negative unit clauses             : 43
8.39/2.15	#    Non-unit-clauses                  : 511
8.39/2.15	# Current number of unprocessed clauses: 16392
8.39/2.15	# ...number of literals in the above   : 83105
8.39/2.15	# Current number of archived formulas  : 0
8.39/2.15	# Current number of archived clauses   : 1083
8.39/2.15	# Clause-clause subsumption calls (NU) : 389938
8.39/2.15	# Rec. Clause-clause subsumption calls : 21339
8.39/2.15	# Non-unit clause-clause subsumptions  : 155
8.39/2.15	# Unit Clause-clause subsumption calls : 794
8.39/2.15	# Rewrite failures with RHS unbound    : 0
8.39/2.15	# BW rewrite match attempts            : 3367
8.39/2.15	# BW rewrite match successes           : 45
8.39/2.15	# Condensation attempts                : 2072
8.39/2.15	# Condensation successes               : 9
8.39/2.15	# Termbank termtop insertions          : 810914
8.39/2.15	# Search garbage collected termcells   : 86874
8.39/2.15	
8.39/2.15	# -------------------------------------------------
8.39/2.15	# User time                : 0.939 s
8.39/2.15	# System time              : 0.042 s
8.39/2.15	# Total time               : 0.980 s
8.39/2.15	# Maximum resident set size: 16308 pages
8.39/2.15	
8.39/2.15	# -------------------------------------------------
8.39/2.15	# User time                : 4.427 s
8.39/2.15	# System time              : 0.183 s
8.39/2.15	# Total time               : 4.610 s
8.39/2.15	# Maximum resident set size: 9252 pages
8.39/2.15	% E exiting
8.39/2.15	% E exiting
8.39/2.16	EOF